The critical surface fugacity of self-avoiding walks on a rotated honeycomb lattice
نویسندگان
چکیده
منابع مشابه
The critical surface fugacity for self-avoiding walks on a rotated honeycomb lattice
In a recent paper with Bousquet-Mélou, de Gier, Duminil-Copin and Guttmann (2012), we proved that a model of self-avoiding walks on the honeycomb lattice, interacting with an impenetrable surface, undergoes an adsorption phase transition when the surface fugacity is 1 + √ 2. Our proof used a generalisation of an identity obtained by Duminil-Copin and Smirnov (2012), and confirmed a conjecture o...
متن کاملThe critical fugacity for surface adsorption of SAW on the honeycomb lattice is 1 + √ 2
Recently Duminil-Copin and Smirnov proved a long-standing conjecture of Nienhuis, made in 1982, that the connective constant of self-avoiding walks on the honeycomb lattice is √ 2 + √ 2. A key identity used in that proof was later generalised by Smirnov so as to apply to a general O(n) model with n ∈ [−2,2]. We modify this model by restricting to a half-plane and introducing a fugacity associat...
متن کاملSelf-avoiding random walks on lattice strips.
A self-avoiding walk on an infinitely long lattice strip of finite width will asymptotically exhibit an end-to-end separation proportional to the number of steps. A proof of this proposition is presented together with comments concerning an earlier attempt to deal with the matter. In addition, some unproved, yet "obvious," conjectures concerning self-avoiding walks are cited as basic propositio...
متن کاملTwo-dimensional self-avoiding walks and polymer adsorption: critical fugacity estimates
Recently Beaton, de Gier and Guttmann proved a conjecture of Batchelor and Yung that the critical fugacity of self-avoiding walks interacting with (alternate) sites on the surface of the honeycomb lattice is 1 + √ 2. A key identity used in that proof depends on the existence of a parafermionic observable for self-avoiding walks interacting with a surface on the honeycomb lattice. Despite the ab...
متن کاملEnumeration of self-avoiding walks on the square lattice
We describe a new algorithm for the enumeration of self-avoiding walks on the square lattice. Using up to 128 processors on a HP Alpha server cluster we have enumerated the number of self-avoiding walks on the square lattice to length 71. Series for the metric properties of mean-square end-to-end distance, mean-square radius of gyration and mean-square distance of monomers from the end points h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2014
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/47/7/075003